A Decentralized Ant Colony Foraging Model Using Only Stigmergic Communication

نویسندگان

  • Giancarlo Fortino
  • Ouarda Zedadra
  • Nicolas Jouandeau
  • Hamid Seridi
چکیده

This paper addresses the problem of foraging by a coordinated team of robots. This coordination is achieved by markers deposited by robots. In this paper, we present a novel decentralized behavioral model for multi robot foraging named cooperative c-marking agent model. In such model, each robot makes a decision according to the affluence of resource locations, either to spread information on a large scale in order to attract more agents or the opposite. Simulation results show that the proposed model outperforms the well-known c-marking agent model. Keywords— Collaborative foraging; reactive coordination; digital pheromone; agent behavioral model; stigmergy.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

When Ants Attack: Security Issues for Stigmergic Systems

Stigmergic systems solve global problems by using indirect communication mediated by an environment. Because they are localized and dynamic, stigmergic systems are self-organizing, robust and adaptive. These properties are useful for creating survivable systems, but stigmergic systems also raise new security concerns. Indirect communication makes systems more vulnerable in an open and hostile e...

متن کامل

Gradient-based Ant Colony Optimization for Continuous Spaces

A novel version of Ant Colony Optimization (ACO) algorithms for solving continuous space problems is presented in this paper. The basic structure and concepts of the originally reported ACO are preserved and adaptation of the algorithm to the case of continuous space is implemented within the general framework. The stigmergic communication is simulated through considering certain direction vect...

متن کامل

Gradient-based Ant Colony Optimization for Continuous Spaces

A novel version of Ant Colony Optimization (ACO) algorithms for solving continuous space problems is presented in this paper. The basic structure and concepts of the originally reported ACO are preserved and adaptation of the algorithm to the case of continuous space is implemented within the general framework. The stigmergic communication is simulated through considering certain direction vect...

متن کامل

Stigmergic Optimization: Inspiration, Technologies and Perspectives

This Chapter summarizes some of the well known stigmergic computational techniques inspired by nature, mainly for optimization problems developed by mimicking social insects’ behavior. Some facts about social insects namely ants, bees and termites are presented with an emphasis on how they could interact and self organize for solving real world problems. We focused on ant colony optimization al...

متن کامل

A New Ant Colony Algorithm Using the Heterarchical Concept Aimed at Optimization of Multiminima Continuous Functions

Ant colony algorithms are a class of metaheuristics which are inspired from the behaviour of real ants. The original idea consisted in simulating the stigmergic communication, therefore these algorithms are considered as a form of adaptive memory programming. A new formalization is proposed for the design of ant colony algorithms, introducing the biological notions of heterarchy and communicati...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014